A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity
نویسنده
چکیده
The Program Committee of the 2001 Conference on Computational Complexity is happy to present the Ron Book Prize for Best Student Paper to Juergen Forster of the Ruhr-Universitaet, Bochum, Germany. The award is given annually to the most outstanding paper written solely by one or more students. The paper selected by the Complexity Program Committee is Complexity 2001 Ron Book Prize for Best Student Paper
منابع مشابه
Extension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملProbabilistic Communication Complexity
Communication is a bottleneck in many distributed computations. In VLSI, communication constraints dictate lower bounds on the performance of chips. The two-processor information transfer model measures the communication requirements to compute functions. We study the unbounded error probabilistic version of this model. Because of its weak notion of correct output, we believe that this model me...
متن کاملRazborov Disjointness Lower Bound , Forster ’ S Theorem
In this lecture, we show two results dealing with lower bounds in communication complexity. The first lower bound is an Ω(n) lower bound on the distributional complexity of Disjointness due to [3, 8]. Here we will present the simplified proof presented in [8]. In the second part, we will show how to obtain lower bounds on the unbounded error probabilistic communication complexity by Forster’s m...
متن کاملSmall Error Versus Unbounded Error Protocols in the NOF Model
We show that a simple function has small unbounded error communication complexity in the k-party number-on-forehead (NOF) model but every probabilistic protocol that solves it with sub-exponential advantage over random guessing has cost essentially Ω (√ n 4 ) bits. Such a separation was first shown for k = 2 independently by Buhrman et al. [8] and Sherstov [24]. A very recent work of Sherstov [...
متن کاملLower Bounds for One-way Probabilistic Communication Complexity
We prove three diierent types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions. The lower bounds are proved in terms of the deterministic communication complexity of functions and in terms of the notion \probabilistic communication characteristic" that we deene. We present boolean functions with the di...
متن کامل